A Variational Baysian Framework for Graphical Models
نویسنده
چکیده
This paper presents a novel practical framework for Bayesian model averaging and model selection in probabilistic graphical models. Our approach approximates full posterior distributions over model parameters and structures, as well as latent variables, in an analytical manner. These posteriors fall out of a free-form optimization procedure, which naturally incorporates conjugate priors. Unlike in large sample approximations, the posteriors are generally nonGaussian and no Hessian needs to be computed. Predictive quantities are obtained analytically. The resulting algorithm generalizes the standard Expectation Maximization algorithm, and its convergence is guaranteed. We demonstrate that this approach can be applied to a large class of models in several domains, including mixture models and source separation.
منابع مشابه
Variational Methods for Graphical Models
∗a summary of [JGJS99] †[email protected] problem [Coo87]. Thus, as in other areas, the research focus has shifted from finding exact algorithms, towards finding good approximation schemes. Nevertheless there are important special instances of graphical models, e.g. trees, where exact algorithms are efficient. And, as we will see, even in the framework of variational methods, we want to use e...
متن کاملInducing Interpretable Representations with Variational Autoencoders
We develop a framework for incorporating structured graphical models in the encoders of variational autoencoders (VAEs) that allows us to induce interpretable representations through approximate variational inference. This allows us to both perform reasoning (e.g. classification) under the structural constraints of a given graphical model, and use deep generative models to deal with messy, high...
متن کاملTractable Variational Structures for Approximating Graphical Models
Graphical models provide a broad probabilistic framework with applications in speech recognition (Hidden Markov Models), medical diagnosis (Belief networks) and artificial intelligence (Boltzmann Machines). However, the computing time is typically exponential in the number of nodes in the graph. Within the variational framework for approximating these models, we present two classes of distribut...
متن کاملNeural Variational Inference and Learning in Undirected Graphical Models
Many problems in machine learning are naturally expressed in the language of undirected graphical models. Here, we propose black-box learning and inference algorithms for undirected models that optimize a variational approximation to the log-likelihood of the model. Central to our approach is an upper bound on the logpartition function parametrized by a function q that we express as a flexible ...
متن کاملA generalized mean field algorithm for variational inference in exponential families
We present a class of generalized mean field (GMF) algorithms for approximate inference in exponential family graphical models which is analogous to the generalized belief prop agation (GBP) or cluster variational meth ods. While those methods are based on over lapping clusters, our approach is based on nonoverlapping clusters. Unlike the cluster variational methods, the approach is proved t...
متن کامل